Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое finite sampling correction - определение
COVER OF A SET
Point finite; Point-finite; Point finite collection
Найдено результатов: 668
Color correction
PROCESS USED IN STAGE LIGHTING, PHOTOGRAPHY, TELEVISION, CINEMATOGRAPHY, AND OTHER DISCIPLINES, WHICH USES COLOR GELS, OR FILTERS, TO ALTER THE OVERALL COLOR OF THE LIGHT
Colour correction; Color correction filter; Color Temperature Orange; Correct To Orange; Color-correction filter; Color correction gel; Color-correction gel
Color correction is a process used in stage lighting, photography, television, cinematography, and other disciplines, which uses color gels, or filters, to alter the overall color of the light. Typically the light color is measured on a scale known as color temperature, as well as along a light yellow –light blue axis orthogonal to the color temperature axis.
Snowball sampling
NONPROBABILITY SAMPLING TECHNIQUE
Snowball sample; Respondent-driven sampling; Snowball method; Snowballed sample
In sociology and statistics research, snowball sampling (or chain sampling, chain-referral sampling, referral sampling (accessed 8 May 2011).Snowball Sampling, Changing Minds.
Šidák correction
MULITPLE COMPARISONS CORRECTION
Sidak correction; Sidak method
In statistics, the Šidák correction, or Dunn–Šidák correction, is a method used to counteract the problem of multiple comparisons. It is a simple method to control the familywise error rate.
Nyquist Theorem
![Subsampled image showing a [[Moiré pattern]]](https://commons.wikimedia.org/wiki/Special:FilePath/Moire pattern of bricks small.jpg?width=200 "Subsampled image showing a [[Moiré pattern]]")
.svg?width=200 "x}}.")
THEOREM
Nyquist theorem; Shannon sampling theorem; Nyquist sampling theorem; Nyquist's theorem; Shannon-Nyquist sampling theorem; Nyquist-Shannon Sampling Theorem; Nyqvist-Shannon sampling theorem; Sampling theorem; Nyquist Sampling Theorem; Nyquist-Shannon sampling theorem; Nyquist–Shannon theorem; Nyquist–Shannon Theorem; Nyquist Theorem; Shannon-Nyquist theorem; Nyquist sampling; Nyquist's law; Nyquist law; Coherent sampling; Nyqvist limit; Raabe condition; Nyquist-Shannon Theorem; Nyquist-Shannon theorem; Nyquist noise theorem; Shannon–Nyquist theorem; Kotelnikov-Shannon theorem; Kotelnikov–Shannon theorem; Nyquist-Shannon; Kotelnikov theorem; Nyquist's sampling theorem; Sampling Theorem; Nyquist Shannon theorem; Nyquist–Shannon–Kotelnikov sampling theorem; Whittaker–Shannon–Kotelnikov sampling theorem; Whittaker–Nyquist–Kotelnikov–Shannon sampling theorem; Nyquist-Shannon-Kotelnikov sampling theorem; Whittaker-Shannon-Kotelnikov sampling theorem; Whittaker-Nyquist-Kotelnikov-Shannon sampling theorem; Cardinal theorem of interpolation; WKS sampling theorem; Whittaker–Kotelnikow–Shannon sampling theorem; Whittaker-Kotelnikow-Shannon sampling theorem; Nyquist–Shannon–Kotelnikov; Whittaker–Shannon–Kotelnikov; Whittaker–Nyquist–Kotelnikov–Shannon; Nyquist-Shannon-Kotelnikov; Whittaker-Shannon-Kotelnikov; Whittaker-Nyquist-Kotelnikov-Shannon; Whittaker–Shannon sampling theorem; Whittaker–Nyquist–Shannon sampling theorem; Whittaker-Nyquist-Shannon sampling theorem; Whittaker-Shannon sampling theorem
<communications> A theorem stating that when an analogue
waveform is digitised, only the frequencies in the waveform
below half the sampling frequency will be recorded. In
order to reconstruct (interpolate) a signal from a sequence of
samples, sufficient samples must be recorded to capture the
peaks and troughs of the original waveform. If a waveform is
sampled at less than twice its frequency the reconstructed
waveform will effectively contribute only noise. This
phenomenon is called "aliasing" (the high frequencies are
"under an alias").
This is why the best digital audio is sampled at 44,000 Hz -
twice the average upper limit of human hearing.
The Nyquist Theorem is not specific to digitised signals
(represented by discrete amplitude levels) but applies to any
sampled signal (represented by discrete time values), not just
sound.
{Nyquist
(http://geocities.com/bioelectrochemistry/nyquist.htm) }
(the man, somewhat inaccurate).
(2003-10-21)
Finite morphism
Finite map (algebraic geometry); Finite type scheme
In algebraic geometry, a finite morphism between two affine varieties X, Y is a dense regular map which induces isomorphic inclusion k\left[Y\right]\hookrightarrow k\left[X\right] between their coordinate rings, such that k\left[X\right] is integral over k\left[Y\right]. This definition can be extended to the quasi-projective varieties, such that a regular map f\colon X\to Y between quasiprojective varieties is finite if any point like y\in Y has an affine neighbourhood V such that U=f^{-1}(V) is affine and f\colon U\to V is a finite map (in view of the previous definition, because it is between affine varieties).
Ewens's sampling formula
SAMPLING FORMULA WHICH DESCRIBES THE PROBABILITIES OF ALLELES IN A SAMPLE
Ewens' sampling formula; Ewens sampling formula; Ewens distribution; Ewens sampling; Ewens's Sampling Formula; Ewens Sampling Formula; Ewens Distribution; Ewens formula
In population genetics, Ewens's sampling formula, describes the probabilities associated with counts of how many different alleles are observed a given number of times in the sample.
Nyquist–Shannon sampling theorem
THEOREM
Nyquist theorem; Shannon sampling theorem; Nyquist sampling theorem; Nyquist's theorem; Shannon-Nyquist sampling theorem; Nyquist-Shannon Sampling Theorem; Nyqvist-Shannon sampling theorem; Sampling theorem; Nyquist Sampling Theorem; Nyquist-Shannon sampling theorem; Nyquist–Shannon theorem; Nyquist–Shannon Theorem; Nyquist Theorem; Shannon-Nyquist theorem; Nyquist sampling; Nyquist's law; Nyquist law; Coherent sampling; Nyqvist limit; Raabe condition; Nyquist-Shannon Theorem; Nyquist-Shannon theorem; Nyquist noise theorem; Shannon–Nyquist theorem; Kotelnikov-Shannon theorem; Kotelnikov–Shannon theorem; Nyquist-Shannon; Kotelnikov theorem; Nyquist's sampling theorem; Sampling Theorem; Nyquist Shannon theorem; Nyquist–Shannon–Kotelnikov sampling theorem; Whittaker–Shannon–Kotelnikov sampling theorem; Whittaker–Nyquist–Kotelnikov–Shannon sampling theorem; Nyquist-Shannon-Kotelnikov sampling theorem; Whittaker-Shannon-Kotelnikov sampling theorem; Whittaker-Nyquist-Kotelnikov-Shannon sampling theorem; Cardinal theorem of interpolation; WKS sampling theorem; Whittaker–Kotelnikow–Shannon sampling theorem; Whittaker-Kotelnikow-Shannon sampling theorem; Nyquist–Shannon–Kotelnikov; Whittaker–Shannon–Kotelnikov; Whittaker–Nyquist–Kotelnikov–Shannon; Nyquist-Shannon-Kotelnikov; Whittaker-Shannon-Kotelnikov; Whittaker-Nyquist-Kotelnikov-Shannon; Whittaker–Shannon sampling theorem; Whittaker–Nyquist–Shannon sampling theorem; Whittaker-Nyquist-Shannon sampling theorem; Whittaker-Shannon sampling theorem
The Nyquist–Shannon sampling theorem is a theorem in the field of signal processing which serves as a fundamental bridge between continuous-time signals and discrete-time signals. It establishes a sufficient condition for a sample rate that permits a discrete sequence of samples to capture all the information from a continuous-time signal of finite bandwidth.
Finite element method
![(b) The [[sparse matrix]] ''L'' of the discretized linear system](https://commons.wikimedia.org/wiki/Special:FilePath/Finite element sparse matrix.png?width=200 "(b) The [[sparse matrix]] ''L'' of the discretized linear system")
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis
The finite element method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential.
Finite Automaton
![TTL]] counter, a type of state machine](https://commons.wikimedia.org/wiki/Special:FilePath/4 bit counter.svg?width=200 "TTL]] counter, a type of state machine")
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser
Finite volume method
METHOD FOR REPRESENTING AND EVALUATING PARTIAL DIFFERENTIAL EQUATIONS
Finite volume; Finite-volume method
The finite volume method (FVM) is a method for representing and evaluating partial differential equations in the form of algebraic equations.
Википедия
Point-finite collection
In mathematics, a collection or family of subsets of a topological space is said to be point-finite if every point of lies in only finitely many members of
A metacompact space is a topological space in which every open cover admits a point-finite open refinement. Every locally finite collection of subsets of a topological space is also point-finite. A topological space in which every open cover admits a locally finite open refinement is called a paracompact space. Every paracompact space is therefore metacompact.
